A Simple Havel-Hakimi Type Algorithm to Realize Graphical Degree Sequences of Directed Graphs
نویسندگان
چکیده
One of the simplest ways to decide whether a given finite sequence of positive integers can arise as the degree sequence of a simple graph is the greedy algorithm of Havel and Hakimi. This note extends their approach to directed graphs. It also studies cases of some simple forbidden edge-sets. Finally, it proves a result which is useful to design an MCMC algorithm to find random realizations of prescribed directed degree sequences.
منابع مشابه
Algorithms for realizing degree sequences of directed graphs
The Havel-Hakimi algorithm for constructing realizations of degree sequences for undirected graphs has been used extensively in the literature. A result by Kleitman and Wang extends the Havel-Hakimi algorithm to degree sequences for directed graphs. In this paper we go a step further and describe a modification of Kleitman and Wang’s algorithm that is a more natural extension of Havel-Hakimi’s ...
متن کاملOn Erdős-Gallai and Havel-Hakimi algorithms
Havel in 1955 [28], Erdős and Gallai in 1960 [21], Hakimi in 1962 [26], Ruskey, Cohen, Eades and Scott in 1994 [69], Barnes and Savage in 1997 [6], Kohnert in 2004 [49], Tripathi, Venugopalan and West in 2010 [83] proposed a method to decide, whether a sequence of nonnegative integers can be the degree sequence of a simple graph. The running time of their algorithms is Ω(n) in worst case. In th...
متن کاملOn the Swap-Distances of Different Realizations of a Graphical Degree Sequence
One of the first graph theoretical problems which got serious attention (already in the fifties of the last century) was to decide whether a given integer sequence is equal to the degree sequence of a simple graph (or it is graphical for short). One method to solve this problem is the greedy algorithm of Havel and Hakimi, which is based on the swap operation. Another, closely related question i...
متن کاملIndependence and the Havel-Hakimi residue
Favaron et al. (1991) have obtained a proof of a conjecture of Fajtlowicz’ computer program Graffiti that for every graph G the number of zeroes left after fully reducing the degree sequence as in the Havel-Hakimi Theorem is at most the independence number of G. In this paper we present a simplified version of the proof of Graffiti’s conjecture, and we find how the residue relates to a natural ...
متن کاملOn Constructing Regular Distance-Preserving Graphs
Let G be a simple, connected graph on n vertices. Let dG(u, v) denote the distance between vertices u and v in G. A subgraph H of G is isometric if dH(u, v) = dG(u, v) for every u, v ∈ V (H). We say that G is a distancepreserving graph if G contains at least one isometric subgraph of order k for every k, 1 ≤ k ≤ n. In this paper we construct regular distance-preserving graphs of all possible or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010